Comprehensive end-to-end storage area network (SAN) application transport service

ABSTRACT

Disclosed is a method and system for transmitting data on a data channel from a source to a destination. The data channel has a plurality of wavelength channels and a throughput. The system and method include a storage application for multicasting data on each of the plurality of wavelength channels, a storage protocol extension device using buffer credits to adjust the throughput during the multicasting, and an application optimization device for managing data channel latency to achieve asymmetric mirroring behavior at the same time as the multicasting.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is related to commonly assigned patent application Ser.No. 10/228,776 filed Aug. 9, 2005, entitled “Asymmetric Data Mirroring”,now the U.S. Pat. No. 6,976,186 issued Dec. 13, 2005, which isincorporated herein by reference. This application is also related tocommonly assigned patent application Ser. No. 11/203,420 filed Aug. 12,2005, entitled “Asymmetric Data Mirroring”, now the U.S. Pat. No.7,549,080 issued on Jun. 16, 2009, which is incorporated herein byreference. This application is also related to commonly assigned patentapplication Ser. No. 11/207,312 filed Aug. 19, 2005, entitled “Methodand System for Long Haul Optical Transport for Applications Sensitive toData Flow Interruption”, now the U.S. Pat. No. 7,839,766 issued on Nov.23, 2010, which is incorporated herein by reference.

BACKGROUND OF THE INVENTION

The present invention relates generally to storage area networks, andmore particularly to a comprehensive, end-to-end storage area network(SAN) application transport service.

With the advent of and growth of the Internet, the availability of datahas become increasingly important. Many corporations need access totheir data during most, if not all, hours of the day. For example,people may be searching the web for a particular piece of information atany time of day. If the information is associated with a corporation'sweb site, the corporation may lose customers if their web site is notfunctioning properly or if the data cannot be retrieved at the time ofsearch. As a result, data storage and availability have become extremelyimportant to businesses in today's competitive landscape.

Data storage devices may fail as a result of system malfunctions,weather disasters, or other types of unforeseen conditions. Corporationstypically have a remote backup storage device to ensure dataavailability when a local storage device fails. Data redundancy is alsoreferred to as data mirroring and typically involves the submission ofsimultaneous write requests to multiple storage devices (i.e., the localand remote data storage devices).

Typically, in a data mirroring arrangement, a server is attached orconnected to a local data storage device as well as to a remote datastorage device with the data from each storage device mirroring that ofanother (or each other).

The distance at which data can reliably be transmitted to a remotestorage device also becomes relevant to performance of a data storagenetwork and data security. Specifically, the shorter the distancebetween a server and data sites, the more quickly the data can besynchronized at the data sites. Maintaining synchronization between dataat mirrored sites is often highly desirable. Synchronization is theability for data in different data sites to be kept up-to-date so thateach data store contains the same information. One way to accomplishsynchronization is by all mirrored storage devices acknowledging receiptof an input/output (I/O) request from a requesting application beforethe application may generate the next I/O request. As the distancebetween mirrored sites increases, synchronization becomes harder toachieve using existing mirroring techniques as the applicationgenerating the I/O request is slowed while awaiting acknowledgment fromthe remote storage device.

It is possible to obtain synchronization using existing techniques ifthe physical distance between the mirrored sites is less thanapproximately twenty-five (25) miles (i.e., 40 km). For greaterdistances, existing techniques may not provide the synchronization thatis needed for maintaining data security in case of a wide-spreadcalamity.

Also, the greater the distance between the mirrored sites, the lesslikely a situation (e.g., a weather disaster or a system failure) willaffect both the local storage device and the remote storage device.Further, when data is transported over increasing distances, thethroughput associated with the data transfer traditionally experiences“throughput droop”. Throughput is defined as the amount of data that canbe transmitted across a data channel at any given time. Throughput isoften represented graphically relative to distance. Throughput droop iswhen a throughput curve goes down or “droops” as the transport distanceincreases. Thus, in order to transmit the maximum amount of data over adata channel, the distance between the server and the remote storagedevice must often be kept within a reasonable distance (e.g., 25 miles).

A transport interruption event is another problem that may beexperienced during data transmission to a remote storage device. Thisoccurs when there is a failure in the data channel. After the failure isrecognized, the transmitting party (e.g., server) may then switch thechannel used to transmit the data. This is referred to as aswitch-to-protect event. When performing this data channel switch, theserver has to synchronize the communications with the remote storagedevice over the new data channel. This resynchronization (after theinitial synchronization over the initial data channel) and switching tothe new data channel traditionally introduces a disruption (e.g., 40milliseconds) in the data transmissions until the synchronization iscomplete.

Thus, there remains a need to provide a comprehensive storage areanetwork (SAN) application transport service that solves theabove-mentioned problems.

BRIEF SUMMARY OF THE INVENTION

A system and method for solving the above mentioned problems transmitsdata on a data channel from a source to a destination. The data channelhas a plurality of wavelength channels and an associated throughput. Thesystem and method include a storage application for multicasting data oneach of the plurality of wavelength channels, a storage protocolextension device for adjusting the throughput during the multicasting byusing buffer credits to determine a capacity of data that can becommunicated between the source and the destination, and an applicationoptimization device for managing data channel latency by submittingrequests to the source and the destination during a predetermined timeperiod associated with the latency. As described in more detail below,data channel latency is the time required for a signal to traverse theround trip distance between a server (or source) and a remote storagedevice plus the maximum write time of the remote storage device.

The data channel may be part of an optical network, such as a FibreChannel network, or a packet-based network, such as a MultiProtocolLabel Switching (MPLS) network. The managing of data channel latency caninclude determining a predetermined time period associated with thelatency between the source and the destination, submitting a request tothe source and to the destination, and submitting additional requests tothe source and the destination during the predetermined time period. Therequest and the additional requests may be resubmitted to thedestination if an acknowledgement is not received. The submission ofadditional requests to the source and destination may also continue ifthe acknowledgement is received.

In one embodiment, the system and method determine whether anacknowledgement associated with the request has been received from thedestination during the predetermined time period. In another embodiment,the system and method store a copy of each request submitted by thesource to the destination in a memory disposed between the source andthe destination while the source waits for whether an acknowledgementassociated with the request has been received from the destinationduring the predetermined time period. In one embodiment, the sourcehalts submission of new requests to the destination if theacknowledgement is not received.

These and other advantages of the invention will be apparent to those ofordinary skill in the art by reference to the following detaileddescription and the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a data mirroring system according to an embodiment of theinvention;

FIG. 2 shows a functional block diagram of the layered SAN transportmodel in accordance with an embodiment of the invention;

FIG. 3 is a flow chart of a data mirroring method in accordance with anembodiment of the invention;

FIG. 4 is a flow chart of an alternative data mirroring method inaccordance with an embodiment of the invention; and

FIG. 5 is a block diagram of a layered model for SAN transport inaccordance with an embodiment of the invention.

DETAILED DESCRIPTION

Data availability, and therefore data storage, has become vitallyimportant to corporations. A failure of a data storage device may resultin millions of dollars lost if a corporation's data is not available. Asa result, corporations often mirror a local data storage device with aremote data storage device.

An exemplary data mirroring system 100 is shown in FIG. 1. The datamirroring system 100 includes a server 110, a local storage device 120and a remote storage device 130. The server 110 and the remote storagedevice 130 may be connected via a communication link 140. Thecommunication link 140 may be a cable connection or a wirelessconnection. The cable may be terrestrial, underwater, etc. It mayutilize a fiber optic medium. The communication link 140 can also be anycombination of these connections (e.g., one portion is a wiredconnection and one portion is a wireless connection). The network formedby the arrangement of FIG. 1 may be a public or a private network.Further, the functions performed by the server 110 described above andbelow may instead be performed by a storage application (as shown inFIG. 2).

There exists asymmetry in the distance between the server 110 and thestorage devices 120 and 130. The distance between server 110 and localstorage device 120 is negligible relative to the distance between server110 and remote storage device 130. In an asymmetric data mirroring (ADM)method according to exemplary embodiments of the present invention, theserver 110 first submits an I/O request (such as a write request of ablock of data) to both the local and remote storage devices 120 and 130and then continues to make additional I/O requests to the devices 120and 130 over a predetermined time period while waiting for anacknowledgement from the remote storage device 130 for the submitted I/Orequest. According to this exemplary embodiment, an acknowledgment(within the predetermined time period or time interval) is required foreach submitted request. The predetermined time period represents thetime needed for a signal to traverse the round trip distance between theserver 110 and the remote storage device 130 plus the maximum write timeof the remote storage device 130. This time period may also be referredto as the round trip latency or network latency and may be measured ordetermined by a processor of the server 110. The write time of theremote storage device 130 may be negligible since the request may firstbe written to cache associated with the remote storage device 130.Therefore an acknowledgement may be submitted by the remote storagedevice 130 upon receipt of the write request from the server 110.

If the server 110 does not receive an acknowledgement from the remotestorage device 130 within the predetermined time period, all furtherrequests to the devices 120 and 130 are halted. At this point, therequest for which an acknowledgement is not received as well as alladditional requests that have been submitted are resubmitted, block byblock, by the server 110 to the remote storage device 130.

It may be appreciated by those skilled in the art that latency betweennetwork nodes, such as server 110 and remote storage device 130, mayvary as a result of network traffic, etc. Accordingly, multiple readingsmay be made in order to determine the round trip latency. That is, anumber of pings may be submitted by the server 110 to determine theaverage latency while also noting the minimum and maximum round triplatency values. Furthermore, the latency will change if the distancebetween the server 110 and the remote storage device 130 is changed forany reason. In this case (i.e., the distance between the server and theremote storage device changes), the latency measurements have to beupdated.

FIG. 2 shows a more detailed block diagram of a storage area network(SAN) having a server 214 in communication with a local storage device(i.e., source) 208 (shown with a dashed box) and a remote storage device(i.e., destination) 212 (also shown with a dashed box). SAN 200 includesa transport network 204 to transmit data from the source to thedestination 212. In one embodiment, server 214 issues an I/O command towrite data to the source 208. The source 208 stores the data in localstorage 210 and also transmits the data over the transport network tothe destination 212 for storage in remote storage 213.

The transport network 204 may include any number of channels (e.g.,fibers) and may have any configuration. The transport network 204 may bean optical network, such as a Fiber Optics network, or may be apacket-based network, such as a Multiprotocol Label Switching (MPLS)network.

In the transport network 204, the data is multicasted over at least twoseparate wavelength channels (or, in the context of an MPLS network,over two separate data channels). The transport network 204 therebyeliminates the switch-to-protect time traditionally needed when afailure occurs. In particular, because the data is being transmittedover multiple channels, no time is needed to switch to a new channel,synchronize a new data transmission between the source 208 and thedestination 212, and then transmit the data over the new channel.Instead, the same data is already being transmitted over multiplewavelength channels before a failure occurs. Thus, no synchronizationtime is needed if a failure occurs.

The source 208 and destination 212 each have a respective switch 216 a,216 b (generally 216). Switch 216 may take the form of a router,Ethernet switch, SAN switch, or any other network element capable ofproviding input data (e.g., optical input data) to the respective source208 or destination 212. Switches 216 may, depending on theirfunctionality and on the requirements of the connecting network, includea programmable processor/controller, memory storage, cross-connect,wavelength converter, processing software including arbitration andevent correlation modules, and a variety of interface modules forcommunicatively connecting the switches 216 to the transport network 204and their respective source 208 or destination 212.

With respect to the multicasting of the data, each switch 216 candetermine which wavelength channel to look at for the data. For example,the switches 216 can always obtain the data from a first wavelengthchannel and ignore the data from the other wavelength channels. If afailure occurs on the first wavelength channel, the switch 216 thenswitches to another wavelength channel. The determination of whichwavelength channel to switch to may be based on an algorithm that theswitch 216 executes.

Each switch 216 is in communication with a respective storage protocolextension device 220 a, 220 b (generally 220). Each storage protocolextension device 220 provides protocol extension techniques such asbuffer credits. Buffer credits are used to enable level throughputcurves at extended transport distances. Without buffer credits, after aparticular distance is reached at which data is being sent over a SAN,the throughput of the network drops sharply. One buffer credit istypically needed for every 2 km of fiber.

Buffer credits enable the production of a more consistent and stablethroughput over extended distances. Specifically, the Fibre Channelprotocol uses a credit-based algorithm to allow or throttle frame flowbased on the capacity of a receiving device's (i.e., storage protocolextension device's) input buffer. To ensure input buffers are notoverrun and frames are not dropped, each ingress Fibre Channel portgives out credits called buffer-to-buffer credits (also referred to asbuffer credits) to permit a transmitting device (i.e., source storageprotocol extension device 220 a) to send frames. During the initialcommunication process, the number of credits that the destinationstorage protocol extension device 220 b can support is exchanged withthe source storage protocol extension device 220 a. This numberdetermines the number of consecutive data frames that may be transmittedby the source storage protocol extension device 220 a before it mustreceive acknowledgement that the earlier frames have been deliveredsuccessfully. Additional credits can only be given when input buffershave been emptied on either end of the link.

Once the data channel is communicating at maximum throughput, the sourcestorage protocol extension device 220 a does not load the data channelwith additional data (until the source storage protocol extension device220 a receives the next acknowledgement from the destination storageprotocol extension device 220 b). This prevents loss of data frames thatmay result if the source extension device 220 a races too far ahead ofthe destination extension device 220 b. As the length of a fiber opticcable span increases for a given throughput, the number of buffercredits required to ensure optimum performance increases in directproportion. Also, as the throughput increases for a given span of fiberoptic cable, the required number of buffer credits increases in directproportion. The storage protocol extension device 220 may be, forexample, a CN 2000 (Ciena Corporation) or an UltraNet StorageDirector-eXtended (USD-X) (McDATA Corporation).

The storage protocol extension devices 220 are also connected toapplication optimization devices 224 a, 224 b (generally 224). Theapplication optimization device 224 manages the latency associated withthe transmission of data over the transport network 204.

FIG. 3 illustrates an exemplary embodiment of the asymmetric datamirroring method implemented using the application optimization devices224. A data mirroring process commences in step 310. As described inmore detail below, the storage application 228 a, 228 b (generally 228)performs the operations of the server 110 shown in FIG. 1. In oneembodiment, the storage application 228 is a processor that communicateswith the server 214 to offload data storage responsibilities from theserver 214.

The storage application 228 a measures a predetermined time period T(round trip latency) in step 315. As described, T represents the timeneeded for a signal to traverse the round trip distance between thestorage application 228 a and the remote storage 213 plus the maximum“write” time of the remote storage 213. At step 320, the storageapplication 228 submits an I/O request (such as a write function in theform of a block of data) to the local storage 210 and remote storage213. A timer t measures the time from submission of the request by thesource 208 (i.e., storage application 228 a). The timer t is compared tothe round trip latency T at step 325. While t remains less than T, thestorage application 228 a checks for the existence of additionalrequests that are to be submitted to the source 208 (i.e., local storage210) and destination 212 (i.e., remote storage 213) at step 330. Ifthere are additional requests, the storage application 228 a submits I/Orequests to the local storage 210 and remote storage 213 at step 320. Ifthere are no additional requests, as determined in step 330, the writingprocess comes to a stop in step 335. If the distance between the storageapplication 228 a and the remote storage 213 changes, then the processcan be restarted at step 310.

When the timer t equals the round trip latency T, the storageapplication 228 a determines whether an acknowledgment from thedestination 212 has been received at step 340. The storage application228 a checks for the existence of additional requests to be submitted tothe local storage 210 and remote storage 213 at step 330 and thedetermination is followed either by an end to the writing process atstep 335 or submission of additional requests to the local and remotestorages 210, 213 at step 320 as described above.

If an acknowledgment has not been received, the storage application 228a resubmits to the destination, at step 345, all requests (block byblock) that have previously been submitted to the local storage 210 andremote storage 213 since the last acknowledgment (if any) while haltingsubmission of new requests. For each request submitted, a timer isstarted and a copy of the submitted request is maintained by theapplication optimization device 224 a. The timer t again measures timefrom the submission of the requests and compares it to the predeterminedround trip latency T at step 350. If an acknowledgment from destination212 is again not recorded by the storage application 228 a at step 355,an error state is triggered at step 360. On the other hand, if anacknowledgment is received at step 355, the storage application 228 achecks for additional requests to be submitted to the destination 212 atstep 330 and the process is continued as described above.

While the above description indicates an error alert being triggeredafter failure to receive acknowledgment for a request that has beensubmitted twice, this number may be increased or decreased. That is, theerror state can be triggered after a request has been submitted once andthe storage application 228 a has failed to receive an acknowledgmentfor this request. On the other hand, a particular request may besubmitted more than two times and a failure to receive an acknowledgmentmore than two times can trigger the error alert.

The process can be restarted from step 335 upon the generation of a newI/O request. In this case, there is no need to re-compute the round triplatency as long as the distance between the storage application 228 aand the remote storage 213 remains constant. The process may then resumeat step 320. Similarly, though not illustrated in FIG. 3, the processmay resume at step 320 after the error at step 360 is detected andcorrected.

A timer as described above may be a plurality of timers each associatedwith a submitted request from the storage application 228 a. Uponreceiving an acknowledgment of the receipt of a particular request, atimer associated with that request may be reset and associated with anext submitted request. As each block of data is submitted by thestorage application 228 a, a copy of the block of data is stored in acache or another type of memory associated with the storage application228 a (e.g., the application optimization device 224 a) until anacknowledgment of the receipt of the submitted block of data is receivedby the storage application 228 a. If an acknowledgment is received, thetimer corresponding to the block of data for which the acknowledgment isreceived is reset and the copy of this block of data is erased from theapplication optimization device 224 a. This facilitates resubmission ofpreviously submitted requests in case of failure by the storageapplication 228 a in receiving an acknowledgment. The functions ofsubmitting a block of data, “writing” of the submitted block of data byboth the local storage 210 and remote storage 213, and submitting anacknowledgment by the remote storage 213 are known and therefore are notdescribed further.

Due to the physical separation between storage application 228 andremote storage 213, there is a difference between the data stored at thelocal storage 210 and that stored at the remote storage 213 at aparticular point in time. That is, a number of blocks of data may bewritten to the local storage 210 before they are written to the remotestorage 213 as a result of the difference in distance between thestorage application 228 a and each of the storage devices and the timeneeded to traverse this distance (i.e., round trip of network latency).This number of blocks is the maximum number of blocks of data that mayhave to be resubmitted by the storage application 228 a to the remotestorage 213 upon failure by the storage application 228 a to receive anacknowledgment according to exemplary embodiments of the presentinvention.

The number of blocks may depend on a plurality of factors. One factor isthe round trip latency or the time needed for a signal to traverse theround trip distance between the storage application 228 a and the remotestorage 213. This amount of time may also be viewed as the time neededto transport a block of data from the storage application 228 a to theremote storage 213 plus the time needed for an acknowledgment signal totravel from the destination 212 to the storage application 228 a.Another factor is the frequency at which the I/O requests are generatedby the server 214.

As the frequency of I/O requests increase, the number of blocks by whichthe remote storage 213 differs from the local storage 210 increases.Knowledge of this number (i.e., difference in blocks) from offered loadand network latency facilitates construction and management of a cachein the storage application 228 a or in a network interface device tocompensate for the difference between the contents of the local storage210 and remote storage 213. In one embodiment, the storage application228 is a Symmetrix Remote Data Facility (SRDF) (EMC Corporation).

In one embodiment, the storage application optimization layer 108 alsoincludes an optional application optimization device 232 (also referredto as a mid-span memory cache) to achieve asymmetric (i.e.,near-synchronous) mirroring. The optional mid-span memory cache 232 maybe positioned between the source 208 and the destination 212. Thecontents of the in-flight data (i.e., data being transmitted from thesource 208 to the destination 212) are therefore stored in the mid-spanmemory cache 232. The data stored in the local storage 210 is equal tothe sum of the data stored in the optional mid-span memory cache 232plus the data stored in remote storage 213. These two devices mirror thedata stored in the local storage 210. It should be noted that any of thefunctions described above and below may be implemented by any of thedevices shown in FIG. 2.

FIG. 4 is a flow diagram of the ADM method in accordance with having anoptional mid-span memory cache 232. A data mirroring process commencesin step 410. The source application 228 measures a predetermined timeperiod T (round trip latency) in step 415. As described above, Trepresents the time required for a signal to traverse the round tripdistance between source application 228 and remote storage 213, plus themaximum write time of the remote storage 213. At step 420, storageapplication 228 a submits an I/O request (such as a write function inthe form of a block of data) to the local storage 210 and remote storage213. A timer t measures the time from submission of the request bystorage application 228 a. The timer t is compared to the round triplatency T at step 425. While t remains less than T, storage application228 a checks for the existence of additional requests that are to besubmitted to the local storage 210 and remote storage 213 at step 430.If there are additional requests, storage application 228 a submits I/Orequests to the local storage 210 and remote storage 213 at step 420. Ifthere are no additional requests, as determined in step 430, the writingprocess is halted in step 435. If the distance between storageapplication 228 a and the remote storage 213 changes, then the processcan be restarted at step 410.

When the timer t equals the round trip latency T, storage application228 a determines whether an acknowledgment from the destination 212 hasbeen received at step 440. The storage application 228 a checks for theexistence of additional requests to be submitted to the local storage210 and remote storage 213 at step 430 and the determination is followedeither by an end to the writing process at step 435 or submission ofadditional requests to the local storage 210 and remote storage 213 atstep 420 as described above.

If an acknowledgment has not been received, storage application 228 aresubmits all requests (block by block) to the remote storage 213 thatwere previously submitted since the last acknowledgment (if any) whilehalting submission of new requests. For each request submitted, a copyof the submitted request has been maintained in the source applicationoptimization device 224 a and the mid-span memory cache 232. At step 445if an acknowledgment for each I/O has been received from the mid-spancache 232, the storage application 228 a instructs the mid-span cache232 to write its contents to the remote storage 213 at step 450. If thecontents of the mid-span cache 232 are successfully written at step 455,control jumps to step 430. If the acknowledgment is not received fromthe mid-span memory cache 232 at step 445, then the contents of thestorage application 228 a (i.e., the source application optimizationdevice 224 a) are written to the remote storage 213 at step 460. If thecontents of neither the source application optimization device 224 a northe mid-span memory cache 232 are written to the remote storage 213,then an error state is triggered at step 465. During step 455, the timert again measures the time from the submission of the requests andcompares it to the predetermined round trip latency T. If anacknowledgment is not received from the destination 212 after theresubmission, the error state is triggered at step 465.

The process can be restarted from step 435 upon the generation of a newI/O request. In this case, there is no need to re-compute the round triplatency as long as the distance between storage application 228 a andremote storage 213 remains constant. The process may then resume at step420. Similarly, the process could resume at step 420 after the error atstep 465 is detected and corrected.

The timer t again measures time from the submission of the requests andcompares it to the predetermined round trip latency T at step 450. If anacknowledgment from destination 212 is again not received by storageapplication 228 a at step 455, but acknowledgments from the mid-spanmemory cache 232 have been received at step 460, then the server 214instructs the mid-span memory cache 232 to write its contents to remotestorage 213 at step 465. If the contents are successfully written atstep 470, control jumps to step 430. If the acknowledgment is notreceived from the mid-span memory cache 232 at step 460, then thecontents of the source application optimization device 224 a are writtento the remote storage 213.

FIG. 5 shows an abstract model 500 of the architecture of the SAN 200 ofFIG. 2. The model 500 includes a storage application layer 504, astorage application optimization layer 508, a storage protocol extensionlayer 512, and a transport/physical layer 516. As described with respectto FIG. 2, each layer of the model 500 can be implemented by one or moredevices.

The storage application layer 504 includes the storage applications 228and is a layer for providing a standard storage protocol interface(e.g., Enterprise Systems Connection (ESCON), Fiber Connectivity(FICON), or Fibre Channel) or Ethernet. The storage applicationoptimization layer 508 includes the application optimization devices 224and is a layer where latency management/compensation is accomplished inorder to enable the most latency sensitive applications to utilize thetransport distance. Techniques employed at this layer includecompression, protocol acceleration, and cache management. As describedabove, the storage application optimization layer 508 enables ADM. Thestorage protocol extension layer 512 includes the storage protocolextension device 220 and provides protocol extension techniques such asbuffer credits. This layer is capable of interfacing with the standardstorage protocols and interfacing on the output side with standardtransport protocols such as Optical Carrier Levels (OCx) and Ethernet.

The transport/physical layer 516 includes the switches 216 and is thelayer where the storage traffic is carried over standard transportprotocols. Here, the transport and physical layer functionality of theOSI model are combined as the two are intertwined in the transport ofstorage protocols. It is essential that protocols that offer predictableand consistent latency and network architectures that manage transportinterruptions so as to be transparent to the application are selected.

The foregoing Detailed Description is to be understood as being in everyrespect illustrative and exemplary, but not restrictive, and the scopeof the invention disclosed herein is not to be determined from theDetailed Description, but rather from the claims as interpretedaccording to the full breadth permitted by the patent laws. It is to beunderstood that the embodiments shown and described herein are onlyillustrative of the principles of the present invention and that variousmodifications may be implemented by those skilled in the art withoutdeparting from the scope and spirit of the invention. Those skilled inthe art could implement various other feature combinations withoutdeparting from the scope and spirit of the invention.

1. A method for transmitting i/o requests on a data channel from asource to a destination, the data channel having a plurality ofwavelength channels and a throughput, each wavelength channel having adistinct wavelength, the method comprising: multicasting i/o requests tothe destination on each of the plurality of wavelength channels;multicasting data on each of the plurality of wavelength channels;recognizing a failure in one of the plurality of wavelength channels;continuing to transmit the data on another of the plurality ofwavelength channels without synchronizing a new channel between thesource and the destination, whereby an average latency between thesource and the destination does not include a time needed to synchronizea new channel when failure occurs; adjusting the throughput during themulticasting by using buffer credits to determine a capacity of i/orequests that can be communicated between the source and thedestination, to produce a consistent throughput; and managing datachannel latency by submitting i/o requests to the destination during apredetermined time period associated with the average latency, includingmanaging a size of a mid-span memory cache disposed between the sourceand the destination based on the average latency and the consistentthroughput; determining the predetermined time period; submitting an i/orequest to the source and to the destination; submitting additional i/orequests to the source and the destination during the predetermined timeperiod; storing copies of the i/o request and the additional i/orequests in the mid-span memory cache disposed between the source andthe destination; continuing submission of additional i/o requests to thesource and the destination if an acknowledgement associated with the i/orequest is received from the destination; resubmitting the i/o requestand the additional i/o requests to the destination if an acknowledgementassociated with the i/o request is not received from the destination andan acknowledgement associated with the i/o request is not received fromthe mid-span memory cache prior to completion of the predetermined timeperiod; and instructing the mid-span memory cache to resubmit the i/orequest and the additional i/o requests to the destination if anacknowledgement associated with the i/o request is not received from thedestination and an acknowledgement associated with the i/o request isreceived from the mid-span cache prior to completion of thepredetermined time period.
 2. The method of claim 1 wherein the datachannel is part of an optical network.
 3. The method of claim 1 whereinthe data channel is part of a packet-based network.
 4. The method ofclaim 1 wherein the determining the predetermined time period comprisesmeasuring an average round trip time for an average i/o request and anacknowledgement.
 5. The method of claim 1 wherein the source haltssubmission of new i/o requests to the destination if the acknowledgementis not received from the destination.
 6. A system for transmitting i/orequests on a data channel from a source to a destination, the datachannel having a plurality of wave length channels and a throughput,each wavelength channel having a distinct wavelength, the systemcomprising: a storage application for multicasting i/o requests to thedestination on each of the plurality of wavelength channels, tomulticast data on each of the plurality of wavelength channels, torecognize a failure in one of the plurality of wavelength channels, andto continue to transmit the data on another of the plurality ofwavelength channels without synchronizing a new channel between thesource and the destination, whereby an average latency between thesource and the destination does not include a time needed to synchronizea new channel when failure occurs; a storage protocol extension devicefor adjusting the throughput by using buffer credits to determine acapacity of data that can be communicated between the source and thedestination to produce a consistent throughput; an applicationoptimization device including a computer readable recording medium formanaging data channel latency by submitting i/o requests to thedestination during a predetermined time period associated with theaverage latency; the application optimization device including amid-span memory cache, a size of the mid-span memory cache being managedbased on the average latency and the consistent throughput, the mid-spanmemory cache being disposed between the source and the destination forstoring copies of the i/o requests submitted to the destination duringthe predetermined time period, the application optimization devicefurther being for instructing the mid-span memory cache to resubmit thei/o requests to the destination if an acknowledgement associated withthe i/o requests is not received from the destination and anacknowledgement associated with the i/o requests is received from themid-span cache prior to completion of the predetermined time period. 7.The system of claim 6 wherein the data channel is part of an opticalnetwork.
 8. The system of claim 6 wherein the data channel is part of apacket-based network.
 9. The system of claim 6 wherein the applicationoptimization device further comprises at least one timer.
 10. A systemfor transmitting i/o requests on a data channel from a source to adestination, the data channel having a plurality of wavelength channelsand a throughput, each wavelength channel having a distinct wavelength,the system comprising: means for multicasting i/o requests to thedestination on each of the plurality of wavelength channels; means formulticasting data on each of the plurality of wavelength channels; meansfor recognizing a failure in one of the plurality of wavelengthchannels; means for continuing to transmit the data on another of theplurality of wavelength channels without synchronizing a new channelbetween the source and the destination, whereby an average latencybetween the source and the destination does not include a time needed tosynchronize a new channel when failure occurs; means for adjusting thethroughput during the multicasting by using buffer credits to determinea capacity of data that can be communicated between the source and thedestination, to produce a consistent throughput; means for managing datachannel latency by submitting i/o requests to the destination during apredetermined time period associated with the average latency; and meansfor storing copies of the i/o requests during the predetermined timeperiod between the source and the destination, the means for managingdata channel latency further being for managing a size of a mid-spanmemory cache disposed between the source and the destination based onthe average latency and the consistent throughput, and for instructingthe means for storing copies to resubmit the i/o requests to thedestination if an acknowledgement is not received from the destinationand an acknowledgement is received from the means for storing copiesprior to completion of the predetermined time period.
 11. The system ofclaim 10 wherein the data channel is part of an optical network.
 12. Thesystem of claim 10 wherein the data channel is part of a packet-basednetwork.
 13. The system of claim 10 wherein the means for managing ofthe data channel latency further comprises: means for determining thepredetermined time period by measuring an average round trip time for anaverage i/o request and an acknowledgement; means for submitting an i/orequest to the source and to the destination; and means for submittingadditional i/o requests to the source and the destination during thepredetermined time period.
 14. The system of claim 13 furthercomprising: means for resubmitting the i/o request and the additionali/o requests to the destination if the acknowledgement from the meansfor storing copies is not received prior to completion of thepredetermined time period; and means for continuing submission ofadditional i/o requests to the source and the destination if theacknowledgement from the destination is received.
 15. The system ofclaim 14 further comprising means for halting submission of new i/orequests to the source and the destination if the acknowledgement is notreceived.